Bandwidth and low dimensional embedding
نویسندگان
چکیده
منابع مشابه
Bandwidth and Low Dimensional Embedding
We design an algorithm to embed graph metrics into `p with dimension and distortion bothdependent only upon the bandwidth of the graph. In particular we show that any graph ofbandwidth k embeds with distortion polynomial in k into O(log k) dimensional `p, 1 ≤ p ≤ ∞.Prior to our result the only known embedding with distortion independent of n was into highdimensional `1 and had d...
متن کاملLow-dimensional Data Embedding via Robust Ranking
ABSTRACT We describe a new method called t-ETE for nding a low-dimensional embedding of a set of objects in Euclidean space. We formulate the embedding problem as a joint ranking problem over a set of triplets, where each triplet captures the relative similarities between three objects in the set. By exploiting recent advances in robust ranking, t-ETE produces high-quality embeddings even in th...
متن کاملLow-dimensional embedding of fMRI datasets
We propose a novel method to embed a functional magnetic resonance imaging (fMRI) dataset in a low-dimensional space. The embedding optimally preserves the local functional coupling between fMRI time series and provides a low-dimensional coordinate system for detecting activated voxels. To compute the embedding, we build a graph of functionally connected voxels. We use the commute time, instead...
متن کاملEmbedding approximately low-dimensional ℓ22 metrics into ℓ1
Goemans showed that any n points x1, . . . xn in d-dimensions satisfying `2 triangle inequalities can be embedded into `1, with worst-case distortion at most √ d. We consider an extension of this theorem to the case when the points are approximately low-dimensional as opposed to exactly low-dimensional, and prove the following analogous theorem, albeit with average distortion guarantees: There ...
متن کاملEmbedding approximately low-dimensional $\ell_2^2$ metrics into $\ell_1$
Goemans showed that any n points x1, . . . xn in d-dimensions satisfying l 2 2 triangle inequalities can be embedded into l1, with worst-case distortion at most √ d. We extend this to the case when the points are approximately low-dimensional, albeit with average distortion guarantees. More precisely, we give an l2-to-l1 embedding with average distortion at most the stable rank, sr (M), of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.05.038